OO Overkill : When Simple is Better than Not 1
نویسنده
چکیده
Object oriented design patterns as popularized in [GHJV95] are intended to solve common programming problems and to assist the programmer in designing and developing robust systems. As first year courses increasingly emphasize object orientation, knowledge of design patterns and when to use them becomes an important component of the first year curriculum. Recent literature has focused on introducing the patterns to computer science educators, but not on the situations and contexts in which the patterns are appropriate. Design patterns and object orientation are parts of a methodology that scales to large systems. In this paper we show that these concepts do not always scale down. We analyze examples from current literature that would be simpler without patterns, and provide examples of when the same design patterns do make design and programs simpler.
منابع مشابه
A premature burial: comments on Grayson and Meltzer’s “Requiem for overkill”
In a recent JAS article (“A requiem for North American overkill”), Donald Grayson and David Meltzer [39] attack Paul Martin’s “overkill” hypothesis that humans caused America’s Terminal Pleistocene megafaunal extinctions. This is one of three similar recent articles by these authors [37–39] in which, by scrupulous evaluation of the archaeological record, they have reduced the list of unambiguou...
متن کاملIsotonic Change Point Estimation in the AR(1) Autocorrelated Simple Linear Profiles
Sometimes the relationship between dependent and explanatory variable(s) known as profile is monitored. Simple linear profiles among the other types of profiles have been more considered due to their applications especially in calibration. There are some studies on the monitoring them when the observations within each profile are autocorrelated. On the other hand, estimating the change point le...
متن کاملOn-line and O -line Approximation Algorithms for Vector Covering Problems
This paper deals with vector covering problems in d-dimensional space. The input to a vector covering problem consists of a set X of d-dimensional vectors in 0; 1] d. The goal is to partition X into a maximum number of parts, subject to the constraint that in every part the sum of all vectors is at least one in every coordinate. This problem is known to be NP-complete, and we are mainly interes...
متن کاملA"Quasi-Rapid"Extinction Population Dynamics and Mammoths Overkill
In this work we suggest and consider an original, simple mathematical model of a ”quasirapid” extinction population dynamics. It describes a decrease and final extinction of the population of one prey species by a ”quasi-rapid” interaction with one predator species with increasing population. This ”quasi-rapid” interaction means ecologically that prey species behaves practically quite passively...
متن کاملA Note on Hilberts Operator
LEMMA L 1 When Kp< oo, then &fis a continuous (bounded) linear transformation with both domain and range Lp( — <*> , oo ), and § 2 / = — ƒ. LEMMA 2. Whenf(t)ÇzLi(— <*>, oo), then §ƒ exists for almost all x in ( — oo , co ), but does not necessarily belong to Li(a, b), where a, b are arbitrary numbers(— oo ^a<b^ oo) ; however (l+x)~\ &f\ÇzLi(— oo , co) when 0<q<l. When f and ^f belong to Li(— oo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000